A Fair Comparison of Message Queuing Systems
نویسندگان
چکیده
The production and real-time usage of streaming data bring new challenges for systems due to huge volume quick response request applications. Message queuing that offer high throughput low latency play an important role in today's big processing. There are several popular message also many in-lab academia. These with different design philosopies have characteristics. It is non-trivial a non-expert choose suitable system meet his specific requirement. With this premise, our primary contribution provide the community fair comparison among systems, using standardized metric reproducible experimental environment. Five typical (including Kafka, RabbitMQ, RocketMQ, ActiveMQ Pulsar) evaluated qualitatively (in analysis) quantitatively results). This article highlights distinct features each summarizes best-suited use cases system. insight analysis provided can help users systems.
منابع مشابه
Message Queuing Systems
Definition Amessage is an information sent by a sender process to a receiver process. A message queue is a mechanism that allows a sender process and a receiver process to exchange messages; the sender posts a message in the queue, and the receiver retrieves the message from the queue. A message queuing system provides a mean to build distributed systems, where distributed processes communicate...
متن کاملComparison of Fair Queuing Algorithms with a Stochastic Approach
In this paper we compare fair queueing algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions. In this way, we try to give a better insight into the performance of a Fair Queueing policy than what worst-case measures can provide. As an application of this approach, we...
متن کاملEligible Start-time Fair Queuing: a New Fair Queuing Policy and Its Analysis with a Stochastic Comparison Approach
We present a new Fair Queuing policy adapted to low-bandwidth ows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processor Sharing PGPS and its version Worst-case Fair, Fair Queuing WF 2 Q which eliminates discrepancy, the proposed scheduling algorithm is computationally eecient hence feasible for high...
متن کاملHierarchical Fair Queuing
In this paper, we present a new queueing algorithm for networks, called Hierarchical Fair Queueing (HFQ). This shares the bandwidth between classes of users, and (within each class) between subclasses. HFQ provides a guaranteed share of bandwidth to each class, but bandwidth is not wasted when a class is inactive. Unlike the Link Sharing scheme of Floyd-Jacobsen, HFQ is provably fair, in that t...
متن کاملRFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. Violation of the service bounds results in nullification of the performance guarantees of the misbehaving client. In this paper we relax this notion of good behavior and present a generalized service model that takes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2020.3046503